On the word problem for free products of semigroups and monoids
نویسندگان
چکیده
We study the language-theoretic aspects of word problem, in sense Duncan & Gilman, free products semigroups and monoids. First, we provide algebraic tools for studying classes languages known as super-AFLs, which generalise e.g. context-free or indexed languages. When C is a super-AFL closed under reversal, prove that semigroup (monoid) product two (resp. monoids) with problem also has C. This recovers generalises recent result by Brough, Cain Pfeiffer class (monoids) taking products. As group-theoretic corollary, deduce (group) groups particular case, find problem.
منابع مشابه
The word problem for free adequate semigroups
We study the complexity of computation in finitely generated free left, right and two-sided adequate semigroups and monoids. We present polynomial time (quadratic in the RAM model of computation) algorithms to solve the word problem and compute normal forms in each of these, and hence also to test whether any given identity holds in the classes of left, right and/or two-sided adequate semigroups.
متن کاملWord Problem Languages for Free Inverse Monoids
This paper considers the word problem for free inverse monoids of finite rank from a language theory perspective. It is shown that no free inverse monoid has context-free word problem; that the word problem of the free inverse monoid of rank 1 is both 2-context-free (an intersection of two context-free languages) and ET0L; that the co-word problem of the free inverse monoid of rank 1 is context...
متن کاملOn the decidability of the word problem for amalgamated free products of inverse semigroups
We study inverse semigroup amalgams [S1, S2;U ], where S1 and S2 are finitely presented inverse semigroups with decidable word problem and U is an inverse semigroup with decidable membership problem in S1 and S2. We use a modified version of Bennett’s work on the structure of Schützenberger graphs of the R-classes of S1 ∗U S2 to state sufficient conditions for the amalgamated free products S1 ∗...
متن کاملOn the Word Problem for Tensor Products and Amalgams of Monoids
We prove that the word problem for the free product with amalgamation S U T of monoids can be undecidable, even when S and T are nitely presented monoids with word problems that are decidable in linear time, the factorization problems for U in each of S and T , as well as other problems, are decidable in polynomial time, and U is a free nitely generated unitary submonoid of both S and T. This i...
متن کاملOn Algebraic Semigroups and Monoids
We present some fundamental results on (possibly nonlinear) algebraic semigroups and monoids. These include a version of Chevalley’s structure theorem for irreducible algebraic monoids, and the description of all algebraic semigroup structures on curves and complete varieties.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2023
ISSN: ['1090-266X', '0021-8693']
DOI: https://doi.org/10.1016/j.jalgebra.2023.02.007